U-Cache: A Cost-Effective Solution to the Synonym Problem
نویسندگان
چکیده
This paper proposes a cost-eeective solution to the synonym problem. In this proposed solution, a minimal hardware addition guarantees the correctness whereas the software counterpart helps improve the performance. The key to this proposed solution is an addition of a small physically-indexed cache called U-cache. The U-cache maintains the reverse translation information of the cache blocks that belong to un-aligned virtual pages only, where aligned means that the lower bits of the virtual page number match those of the corresponding physical page number. A U-cache, even with only one entry, ensures correct handling of synonyms. A simple software optimization, in the form of page alignment, helps improve the performance. Performance evaluation based on ATUM traces shows that a U-cache, with only a few entries, performs almost as well as (in some cases outperforms) a fully-conngured hardware-based solution when more than 95 % of the pages are aligned.
منابع مشابه
U-cache: A cost-effective solution to the virtual cache synonym problem
This paper proposes a cost-eeective solution to the virtual cache synonym problem. In the proposed solution, a minimal hardware addition guarantees correct handling of the synonym problem whereas a simple modiication to the virtual-to-physical address mapping in the operating system optimizes the performance. The key to the proposed solution is a small physically-indexed cache called a U-cache....
متن کاملA multi-objective genetic algorithm for a mixed-model assembly U-line balancing type-I problem considering human-related issues, training, and learning
Mixed-model assembly lines are increasingly accepted in many industrial environments to meet the growing trend of greater product variability, diversification of customer demands, and shorter life cycles. In this research, a new mathematical model is presented considering balancing a mixed-model U-line and human-related issues, simultaneously. The objective function consists of two separate com...
متن کاملAn Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neig...
متن کاملCache Placement Optimization in Hierarchical Networks: Analysis and Performance Evaluation
Caching popular content in the Internet has been recognized as one of the effective solution to alleviate network congestion and accelerate user information access. Sharing and coordinating in cache data placement provide an opportunity to improve system performance. This paper studies cache placement strategies and their performance in hierarchical network environments. A theoretical model is ...
متن کاملGlobal attractor for a nonlocal hyperbolic problem on ${mathcal{R}}^{N}$
We consider the quasilinear Kirchhoff's problem$$ u_{tt}-phi (x)||nabla u(t)||^{2}Delta u+f(u)=0 ,;; x in {mathcal{R}}^{N}, ;; t geq 0,$$with the initial conditions $ u(x,0) = u_0 (x)$ and $u_t(x,0) = u_1 (x)$, in the case where $N geq 3, ; f(u)=|u|^{a}u$ and $(phi (x))^{-1} in L^{N/2}({mathcal{R}}^{N})cap L^{infty}({mathcal{R}}^{N} )$ is a positive function. The purpose of our work is to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995